Stochastic Approximation for Expensive One-Bit Feedback Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supplementary Material: Online Stochastic Linear Optimization under One-bit Feedback

A. More Strategies for Efficient Implementations Enlarging the Confidence region For a positive definite matrix A ∈ Rd×d, we define ‖x‖1,A = ‖Ax‖1. When studying SLB, Dani et al. (2008) propose to enlarge the confidence region from Ct+1 = { w : ‖w −wt+1‖Zt+1 ≤ √ γt+1 } to C̃t+1 = { w : ‖w −wt+1‖1,Zt+1 ≤ √ dγt+1 } such that the computational cost could be reduced. This idea can be direct incorpor...

متن کامل

Online Stochastic Linear Optimization under One-bit Feedback

In this paper, we study a special bandit setting of online stochastic linear optimization, where only one-bit of information is revealed to the learner at each round. This problem has found many applications including online advertisement and online recommendation. We assume the binary feedback is a random variable generated from the logit model, and aim to minimize the regret defined by the un...

متن کامل

One-bit stochastic resonance storage device

The increasing capacity of modern computers, driven by Moore’s Law, is accompanied by smaller noise margins and higher error rates. In this paper we propose a memory device, consisting of a ring of two identical overdamped bistable forward-coupled oscillators, which may serve as a building block in a larger scale solution to this problem. We show that such a system is capable of storing one bit...

متن کامل

Thresholds Optimization for One-Bit Feedback Multi-User Scheduling

We propose a new one-bit feedback scheme with scheduling decision based on the maximum expected weighted rate. We show the concavity of the 2-user case and provide the optimal solution which achieves the maximum weighted rate of the users. For the general asymmetric M -user case, we provide a heuristic method to achieve the maximum expected weighted rate. We show that the sum rate of our propos...

متن کامل

One-Bit Sphere Decoding for Uplink Massive MIMO Systems with One-Bit ADCs

This paper presents a low-complexity near-maximum-likelihood-detection (near-MLD) algorithm called one-bit-sphere-decoding for an uplink massive multiple-input multiple-output (MIMO) system with one-bit analog-to-digital converters (ADCs). The idea of the proposed algorithm is to estimate the transmitted symbol vector sent by uplink users (a codeword vector) by searching over a sphere, which co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tsinghua Science and Technology

سال: 2017

ISSN: 1007-0214

DOI: 10.23919/tst.2017.7914203